Cost-function-based hypothesis control techniques for multiple hypothesis tracking

The problem of tracking targets in clutter naturally leads to a Gaussian mixture representation of the probability density function of the target state vector. Modern tracking methods maintain the mean, covariance and probability weight corresponding to each hypothesis, yet they rely on simple merging and pruning rules to control the growth of hypotheses. This paper proposes a structured, cost-function-based approach to the hypothesis control problem, utilizing the Integral Square Error (ISE) cost measure. A comparison of track life performance versus computational cost is made between the ISE-based filter and previously proposed approximations including simple pruning, Singer’s n-scan memory filter, Salmond’s joining filter, and Chen and Liu’s Mixture Kalman Filter (MKF). The results demonstrate that the ISE-based mixture reduction algorithm provides track life performance which is significantly better than the compared techniques using similar numbers of mixture components, and performance competitive with the compared algorithms for similar mean computation times.